Better bounds for perpetual gossiping
نویسندگان
چکیده
منابع مشابه
Better Bounds for Perpetual Gossiping
In the perpetual gossiping problem, introduced by Liestman and Richards, information may be generated at any time and at any vertex of a graph G; adjacent vertices can communicate by telephone calls. We define Wk(G) to be the minimum w such that, placing at most k calls each time unit, we can ensure that every piece of information is known to every vertex within w time units of its generation. ...
متن کاملBetter Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contains at most k facilities. We say that this incremental medians sequence is R-competitive if the cost of each Fk is at most R times the optimum cost of k facilities. The smallest such R is called the competitive ratio of the se...
متن کاملBetter Bounds for Graph Bisection
We introduce new lower bounds for the minimum graph bisection problem. Within a branch-and-bound framework, they enable the solution of a wide variety of instances with tens of thousands of vertices to optimality. Our algorithm compares favorably with the best previous approaches, solving long-standing open instances in minutes.
متن کاملNew bounds on the minimum calls of failure-tolerant gossiping
Gossiping is an extensively investigated information dissemination process. In gossiping, every vertex holds a message which has to be transmitted to all other vertices. This paper deals with k-failure tolerant gossiping, which investigates the minimum number of transmissions (calls) required by the communication process, provided that at most k transmissions may fail. We show new bounds for th...
متن کاملBetter Bounds for k-Partitions of Graphs
Combinatorics, Probability and Computing / Volume 20 / Issue 04 / July 2011, pp 631 640 DOI: 10.1017/S0963548311000204, Published online: 31 May 2011 Link to this article: http://journals.cambridge.org/abstract_S0963548311000204 How to cite this article: BAOGANG XU and XINGXING YU (2011). Better Bounds for k-Partitions of Graphs. Combinatorics, Probability and Computing, 20, pp 631-640 doi:10.1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00088-1